Blocking probabilities of multi-layer multicast streams

نویسندگان

  • Jouni Karvo
  • Samuli Aalto
  • Jorma Virtamo
چکیده

Abstract—We present two new algorithms for calculating call blocking probabilities for multi-layer multicast streams with the assumption that blocked calls are lost. Users may join and leave the multicast connections freely, thus creating dynamic multicast trees. We define the state space, and give two recursive algorithms; for the general case and for the special case where all multicast channels are statistically indistinguishable. Our recursive algorithms are linear with respect to the number of links. The special case is also polynomial with respect to the number of channels.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A study of teletraffic problems in multicast networks

This dissertation studies teletraffic engineering of dynamic multicast connections. The traditional models in teletraffic engineering do not handle multicast connections properly, since in a dynamic multicast tree, users may join and leave the connection freely, and thus the multicast tree evolves in time. A model called multicast loss system is used to calculate blocking probabilities in a sin...

متن کامل

On Calculation Methodology of the Multi-Stage Switching Network with Multicast Traffic Streams

In this paper we propose a new approximate method for calculating the probability of point-to-group blocking in multi-stage switching networks with unicast and multicast connections. The results of analytical calculations of the probability of blocking are compared with the results of discrete events simulations of the switching network with multicast and unicast connections. The present analyt...

متن کامل

Telecommunication Systems 0 ( 1998 ) ? ? 1 Blocking of dynamic multicast

Multicast connections have a bandwidth saving nature. This means that a multicast connection in taking the form of a tree with streams merging at the nodes requires much less capacity from the network links than a bunch of separate point-to-point connections providing the same connectivity. In this paper, we consider dynamic multicast connections that can be used to model, for example, TV or ra...

متن کامل

Collaborative Multicast Architecture for Multi-Stream Applications

In multicast applications such as video conference which consist of multiple streams, not all streams are of equal interest to all receivers. In this case we believe that this disparity in receiver interest should be reflected in the rate adaptation. This paper presents collaborative rate management architecture, named CRM, for layered multicast streams. CRM estimates shared bottleneck links am...

متن کامل

Rate-Splitting for Multi-Antenna Non-Orthogonal Unicast and Multicast Transmission

In a superimposed unicast and multicast transmission system, one layer of Successive Interference Cancellation (SIC) is required at each receiver to remove the multicast stream before decoding the unicast stream. In this paper, we show that a linearly-precoded Rate-Splitting (RS) strategy at the transmitter can efficiently exploit this existing SIC receiver architecture. By splitting the unicas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001